A Hierarchical Lagrangean Relaxation Procedure for Solving Midterm Planning Problems
نویسندگان
چکیده
Industrial & Engineering Chemistry Research is published by the American Chemical Society. 1155 Sixteenth Street N.W., Washington, DC 20036 Article A Hierarchical Lagrangean Relaxation Procedure for Solving Midterm Planning Problems Anshuman Gupta, and Costas D. Maranas Ind. Eng. Chem. Res., 1999, 38 (5), 1937-1947• DOI: 10.1021/ie980782t • Publication Date (Web): 26 March 1999 Downloaded from http://pubs.acs.org on March 2, 2009
منابع مشابه
Multicommodity Capacitated Network Design
This paper presents a comprehensive survey of models and algorithms for multicommodity capacitated network design problems, which are mostly encountered in telecommunications and transportation network planning. These problems are important not only due to the major relevance of their applications, but also because they pose considerable modeling and algorithmic challenges. We present a general...
متن کاملFixed Charge Transportation Problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
In this paper the Fixed Charge Transportation Problem is considered. A new heuristic approach is proposed, based on the intensive use of Lagrangean relaxation techniques. The more novel aspects of this approach are new Lagrangean relaxation and decomposition methods, the consideration of several core problems, defined from the previously computed Lagrangean reduced costs, the heuristic selectio...
متن کاملIn Packet - Switching Networks : a Hierarchical Planning Approach
We address the problem of planning the cap~ city augmentation of a packet-switching network with given routing and topology under uncertainty of future costs and traffic requirements. Recent advances in hierarchical planning and lagrangean relaxation techniques allow to minimize the present cost plus the expected value of future costs, without exceeding a specified threshold for the average delay.
متن کاملSimultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem
Conventional Lagrangean preprocessing for the network Weight Constrained Shortest Path Problem (WCSPP), for example Beasley and Christofides [3], calculates lower bounds on the cost of using each node and edge in a feasible path using a single optimal Lagrange multiplier for the relaxation of the WCSPP. These lower bounds are used in conjunction with an upper bound to eliminate nodes and edges....
متن کاملLagrangean Based Methods for Solving Large-Scale Cellular Network Design Problems
The cellular network design (CND) problem is formulated as a comprehensive linear mixed integer programming model integrating the base station location (BSL) problem, the frequency channel assignment (FCA) problem and the topological network design (TND) problem. A solution algorithm based on Lagrangean relaxation is proposed for solving this complex cellular network design problem. Pursuing th...
متن کامل